منابع مشابه
Semi-Uniform Adaptive Patch Tessellation
We present an adaptive tessellation scheme for surfaces consisting of parametric patches. The resulting tessellations are topologically uniform, yet consistent and watertight across boundaries of patches with different tessellation levels. Our scheme is simple to implement, requires little memory, and is well suited for instancing, a feature available on current GPUs that allows a substantial p...
متن کاملSemi-uniform, 2-Different Tessellation of Triangular Parametric Surfaces
With a greater number of real-time graphics applications moving over to parametric surfaces from the polygonal domain, there is an inherent need to address various rendering bottlenecks that could hamper the move. Scaling the polygon count over various hardware platforms becomes an important factor. Much control is needed over the tessellation levels, either imposed by the hardware limitations ...
متن کاملPatch-Based Occlusion Culling for Hardware Tessellation
We present an occlusion culling algorithm that leverages the unique characteristics of patch primitives within the hardware tessellation pipeline. That is, unseen patches are costly to compute, but easy to find screen space bounds for. Our algorithm uses the well known hierarchical Z-buffer approach, but we present a novel variant that uses temporal coherence to maintain lists of visible and oc...
متن کاملEffective Back-Patch Culling for Hardware Tessellation
When rendering objects with hardware tessellation, back-facing patches should be culled as early as possible to avoid unnecessary surface evaluations, and setup costs for the tessellator and rasterizer. For dynamic objects the popular cone-of-normals approach is usually approximated using tangent and bitangent cones. This is faster to compute, but less effective. We present a novel approach usi...
متن کاملAdaptive Tessellation of NURBS Surfaces
NURBS surfaces are widely used in computer graphics, due to their great accuracy of design and reduced amount of data needed for representation. For real-time visualization, tessellation algorithms are needed, as they make use of the actual graphics hardware through the conversion of surfaces to triangle meshes. The existent algorithms for tessellation are only partially adaptive because the te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2009
ISSN: 0167-7055,1467-8659
DOI: 10.1111/j.1467-8659.2009.01438.x